Locally bounded hereditary subclasses of k-colourable graphs
نویسندگان
چکیده
منابع مشابه
Grid drawings of k-colourable graphs
Let G = (V,E) be a graph. All graphs considered are simple, £nite and undirected. A grid drawing of G is an injective mapping θ : V → Z such that for all edges vw ∈ E and vertices x ∈ V , θ(x) ∈ θ(v)θ(w) implies that x = v or x = w, where ab denotes the line-segment with endpoints a and b. That is, a grid drawing of a graph represents each vertex by a distinct gridpoint in the plane, and each e...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملSparse H-Colourable Graphs of Bounded Maximum Degree
Let F be a graph of order at most k. We prove that for any integer g there is a graph G of girth at least g and of maximum degree at most 5k13 such that G admits a surjective homomorphism c to F , and moreover, for any F -pointed graph H with at most k vertices, and for any homomorphism h from G to H there is a unique homomorphism f from F to H such that h = f ◦ c. As a consequence, we prove th...
متن کامل(k, +)-Distance-Hereditary Graphs
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networks with desirable connectivity properties; a network modeled as a (k, +)–distance-hereditary graph can be characterized as follows: if some nodes have failed, as long as two nodes remain connected, the distance between the...
متن کاملAlgorithms for Graphs of (Locally) Bounded Treewidth
Many real-life problems can be modeled by graph-theoretic problems. These graph problems are usually NP-hard and hence there is no efficient algorithm for solving them, unless P= NP. One way to overcome this hardness is to solve the problems when restricted to special graphs. Trees are one kind of graph for which several NP-complete problems can be solved in polynomial time. Graphs of bounded t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00378-4